翻訳と辞書 Words near each other ・ Agreement (linguistics) ・ Agreement Between Great Britain and Denmark Relating to the Suppression of the Capitulations in Egypt ・ Agreement Between Great Britain and Greece Relating to the Suppression of the Capitulations in Egypt (1920) ・ Agreement Between Great Britain and Norway Relating to the Suppression of the Capitulations in Egypt ・ Agreement between Great Britain and Portugal Relating to the Suppression of the Capitulations in Egypt ・ Agreement Between Great Britain and Sweden Relating to the Suppression of the Capitulations in Egypt (1921) ・ Agreement between New Zealand and Singapore on a Closer Economic Partnership ・ Agreement between the Allied and Associated Powers with Regard to the Contribution to the Cost of Liberation of the Territories of the Former Austro-Hungarian Monarchy ・ Agreement Between the Allied and Associated Powers with Regard to the Italian Reparation Payments ・ Agreement concerning the Manufacture of, Internal Trade in and Use of Prepared Opium ・ Agreement for Democracy ・ Agreement for the Control of Opium Smoking in the Far East ・ Agreement for the Country ・ Agreement for the New Greece ・ Agreement for the Suppression of the Circulation of Obscene Publications ・ Agreement forest ・ Agreement in English law ・ Agreement in principle ・ Agreement of Friendship, Cooperation, and Mutual Assistance ・ Agreement of Saint-Jean-de-Maurienne ・ Agreement of the People ・ Agreement of Łęgonice ・ Agreement on a Cease-fire and Separation of Forces ・ Agreement on Agriculture ・ Agreement on Disengagement between Israel and Syria ・ Agreement on Ending the War and Restoring Peace in Vietnam ・ Agreement on Friendship and Cooperation between Bosnia and Herzegovina and Croatia ・ Agreement on Government Procurement ・ Agreement on Humane Trapping Standards ・ Agreement on Internal Trade Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Agreement forest ： ウィキペディア英語版 Agreement forest In the mathematical field of graph theory, an agreement forest for two given (leaf-labeled, irreductible) trees is any (leaf-labeled, irreductible) forest which can, informally speaking, be obtained from both trees by removing a common number of edges. Agreement forests first arose when studying combinatorial problems related to computational phylogenetics, in particular tree rearrangements. == Preliminaries == Recall that a tree (or a forest) is irreductible when it lacks any internal node of degree 2. In the case of a rooted tree (or a rooted forest), the root(s) are of course allowed to have degree 2, since they are not internal nodes. Any tree (or forest) can be made irreductible by applying a sequence of edge contractions. An irreductible (rooted or unrooted) tree whose leaves are bijectively labeled by elements of a set is called a (rooted or unrooted) -tree. Such a -tree usually model a phylogenetic tree, where the elements of (the taxon set) could represent species, individual organisms, DNA sequences, or other biological objects. Two -trees and are said to be isomorphic when there exists a graph isomorphism between them which preserves the leaf labels. In the case of rooted -trees, the isomorphism must also preserves the root. Given a -tree and a taxon subset , the minimal subtree of that connects all leaves in is denoted by . When is rooted, then is also rooted, with its root being the node closest to the original root of . This subtree needs not be a -tree, because it might not be irreductible. We therefore further define the restricted subtree , which is obtained from by suppressing all internal nodes of degree 2, yielding a proper -tree. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Agreement forest」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.